Iterative approximation of solutions for proximal split feasibility problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Halpern’s Iterative Scheme for Solving Split Feasibility Problems

and Applied Analysis 3 PK is called the metric projection ofH ontoK. It is well known that PK is a nonexpansive mapping ofH onto K and satisfies 〈x − y, PKx − PKy〉 ≥ ∥ PKx − PKy ∥ ∥ 2 , 2.3 for every x, y ∈ H. Moreover, PKx is characterized by the following properties: PKx ∈ K and 〈x − PKx, y − PKx〉 ≤ 0, ∥ ∥x − y∥∥ ≥ ‖x − PKx‖ ∥ ∥y − PKx ∥

متن کامل

Approximation Methods for Solutions of System of Split Equilibrium Problems

In this paper, we introduce a new algorithm for finding a common fixed point of a finite family of continuous pseudocontractive mappings which is a unique solution of some variational inequality problem and whose image under some bounded linear operator is a common solution of some system of equilibrium problems in a real Hilbert space. Our result generalize and improve some well-known results.

متن کامل

Convergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems

In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...

متن کامل

Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems

In this paper, we present an extended alternating proximal penalization algorithm for the modified multiple-sets feasibility problem. For this method, we first show that the sequences generated by the algorithm are summable, which guarantees that the distance between two adjacent iterates converges to zero, and then we establish the global convergence of the algorithm provided that the penalty ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fixed Point Theory and Applications

سال: 2015

ISSN: 1687-1812

DOI: 10.1186/s13663-015-0375-5